Functional logic programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Functional Logic Programming

This paper presents PFLP, a library for probabilistic programming in the functional logic programming language Curry. It demonstrates how the concepts of a functional logic programming language support the implementation of a library for probabilistic programming. In fact, the paradigms of functional logic and probabilistic programming are closely connected. That is, we can apply techniques fro...

متن کامل

Multi-paradigm Logic Programming Some Applications of Functional-logic Programming

We show examples for higher-order functional logic programming in which both programming concepts nicely complement each other. These include modeling distributed systems, parsing and hardware synthesis.

متن کامل

Logic Programming, Functional Programming, and Inductive Definitions

An attempt at unifying logic and functional programming is reported. As a starting point, we take the view that"logic programs"are not about logic but constitute inductive definitions of sets and relations. A skeletal language design based on these considerations is sketched and a prototype implementation discussed.

متن کامل

Constraint Functional Logic Programming Revisited

In this paper we propose a new generic scheme CFLP (D), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. As in the case of the well known CLP (D) scheme for Constraint Logic Programming, D is assumed to provide domain specific data values and constraints. CFLP (D) programs are presented as sets of cons...

متن کامل

Extended Logic-plus-Functional Programming

Extensions of logic and functional programming are integrated in RELFUN. Its valued clauses comprise Horn clauses (`true'-valued) and clauses with a distinguished`foot' premise (returning arbitrary values). Both the logic and functional components permit LISP-like varying-arity and higher-order operators. The DATAFUN sublanguage of the functional component is shown to be preferable to relationa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the ACM

سال: 2010

ISSN: 0001-0782,1557-7317

DOI: 10.1145/1721654.1721675